package com.atguigu.practice;

import java.util.Scanner;

public class TheMinComNumber {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        int a=scanner.nextInt();
        int b=scanner.nextInt();
        if(a%b==0||b%a==0){
            System.out.println(a>b?a:b);
            return;
        }
        //辗转相除法求最大公约数
        int m=a,n=b;
        while(m%n!=0){
            int j=n;
            n=m%n;
            m=j;
        }
        if(n==1){
            System.out.println(a*b);
            return;
        }else{
            System.out.println(a*b/n);
        }
    }
}
